Introduction of the weight edition errors in the Levenshtein distance
نویسنده
چکیده
In this paper, we present a new approach dedicated to correcting the spelling errors of the Arabic language. This approach corrects typographical errors like inserting, deleting, and permutation. Our method is inspired from the Levenshtein algorithm, and allows a finer and better scheduling than Levenshtein. The results obtained are very satisfactory and encouraging, which shows the interest of our new approach. Keywordscomponent;spelling errors; correction; Levenshtein distance; weight edition error.
منابع مشابه
Introduction of the weight edition errors in the Levenshtein distance
—In this paper, we present a new approach dedicated to correcting the spelling errors of the Arabic language. This approach corrects typographical errors like inserting, deleting, and permutation. Our method is inspired from the Levenshtein algorithm, and allows a finer and better scheduling than Levenshtein. The results obtained are very satisfactory and encouraging, which shows the interest o...
متن کاملAdaptating the Levenshtein Distance to Contextual Spelling Correction
In the last few years, computing environments for human learning have rapidly evolved due to the development of information and communication technologies. However, the use of information technology in automatic correction of spelling errors has become increasingly essential. In this context, we have developed a system for correcting spelling errors in the Arabic language based on language mode...
متن کاملEnhancing Iris Matching Using Levenshtein Distance with Alignment Constraints
Iris recognition from surveillance-type imagery is an active research topic in biometrics. However, iris identification in unconstrained conditions raises many proplems related to localization and alignment, and typically leads to degraded recognition rates. While development has mainly focused on more robust preprocessing, this work highlights the possibility to account for distortions at matc...
متن کاملCorrectable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes
The number of correctable/uncorrectable errors of weight half the minimum distance plus one for the first-order Reed-Muller codes is determined. From a cryptographic viewpoint, this result immediately leads to the exact number of Boolean functions of m variables with nonlinearity 2m−2 + 1. The notion of larger half and trial set , which is introduced by Helleseth, Kløve, and Levenshtein to desc...
متن کاملPruned Convolutional Codes and Viterbi Decoding Using the Levenshtein Distance Metric Applied to Asynchronous Noisy Channels
For a convolutional encoding and Viterbi decoding system, two insertion/deletion/substitution (IDS) error correcting techniques are presented in this paper. In the first means, by using the pruned convolutional codes, a rate compatible encoding system can adapt the transmission according to the state of the channel having IDS errors. In the second means, a convolutional encoded sequence is deco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.4503 شماره
صفحات -
تاریخ انتشار 2012